Finding a minimal tree in a polygon with its medial axis
نویسندگان
چکیده
In order to solve a problem arising when generalizing topographical maps, we consider the following problem for simple polygons, i.e., coherent polygons without holes. Some edges of the polygon may be marked as hard, and at least two vertices of the polygon are marked as terminals. We show that the problem to nd a tree of minimum total length, spanning the hard edges and terminals, using only edges of the polygon and its medial axis, can be stated as the problem to nd a minimum Steiner tree in a Halin graph, and can be eÆciently solved in linear time.
منابع مشابه
Algorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملFinding the Medial Axis of a Simple Polygon in Linear Time
We give a linear-time algorithm for computing the medial axis of a simple polygon P, This answers a long-standing open question|previously, the best deterministic algorithm ran in O(n log n) time. We decompose P into pseudo-normal histograms, then innuence histograms and xy monotone histograms. We can compute the medial axes for xy monotone his-tograms and merge to obtain the medial axis for P.
متن کاملA Novel Type of Skeleton for Polygons
A new internal structure for simple polygons, the straight skeleton, is introduced and discussed. It is composed of pieces of angular bisectores which partition the interior of a given n-gon P in a tree-like fashion into n monotone polygons. Its straight-line structure and its lower combinatorial complexity may make the straight skeleton preferable to the widely used medial axis of a polygon. A...
متن کاملOn triangulation axes of polygons
We propose the triangulation axis as an alternative skeletal structure for a simple polygon P . This axis is a straight-line tree that can be interpreted as an anisotropic medial axis of P , where inscribed disks are line segments or triangles. The underlying triangulation that specifies the anisotropy can be varied, to adapt the axis so as to reflect predominant geometrical and topological fea...
متن کاملتقویت محور مرکزی ساختارهای لولهای و کاربرد آن در استخراج محور مرکزی سیاهرگ پورتال
I In this paper, a new filter is designed to enhance medial-axis of tubular structures. Based on a multi-scale method and using eigenvectors of Hessian matrix, the distance of a point to the edges of the tube is found. To do this, a hypothetical line with a deliberate direction is passed through the point which cuts the tube at its edges. For points which are located on the medial-axis, this di...
متن کامل